program q1291;
var
    m, n, i, j, t, ans:integer;
    apple, tao: array[1..2000] of integer;
begin
    assign(input, '');
    assign(output, '');
    reset(input);
    rewrite(output);

    readln(n, m);
    for i:=1 to n do
        readln(apple[i]);
    for i:=1 to m do
    begin
        readln(tao[i]);
        if (tao[i] < 0) then tao[i] := 0;
    end;

    for i:=1 to n-1 do
        for j:=i+1 to n do
            if (apple[j] > apple[i]) then
            begin
                t :=apple[j]; apple[j] := apple[i]; apple[i] := t;
            end;
    for i:=1 to m-1 do
        for j:=i+1 to m do
            if (tao[j] < tao[i]) then
            begin
                t := tao[j]; tao[j] := tao[i]; tao[i] := t;
            end;

    ans := m;
    for i:=1 to n do
        for j:=m downto 1 do
            if (apple[i] > tao[j]) and (tao[j] <= 300) then 
            begin
                dec(ans);
                tao[j] := 301;
                break;
            end;

    writeln(ans);

    close(input);
    close(output);
end.
